Lattice Points and Simultaneous Core Partitions
نویسنده
چکیده
We observe that for a and b relatively prime, the “abacus construction” identifies the set of simultaneous (a, b)-core partitions with lattice points in a rational simplex. Furthermore, many statistics on (a, b)-cores are piecewise polynomial functions on this simplex. We apply these results to rational Catalan combinatorics. Using Ehrhart theory, we reprove Anderson’s theorem [3] that there are (a + b− 1)!/a!b! simultaneous (a, b)-cores, and using Euler-Maclaurin theory we prove Armstrong’s conjecture [12] that the average size of an (a, b)core is (a + b + 1)(a− 1)(b− 1)/24. Our methods also give new derivations of analagous formulas for the number and average size of self-conjugate (a, b)-cores. We conjecture a unimodality result for q rational Catalan numbers, and make preliminary investigations in applying these methods to the (q, t)-symmetry and specialization conjectures. We prove these conjectures for low degree terms and when a = 3, connecting them to the Catalan hyperplane arrangement and proving an apparently new result about permutation statistics along the way.
منابع مشابه
Results and conjectures on simultaneous core partitions
An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that are simultaneously a-core and b-core for two relatively prime integers a and b, which correspond to abacus diagrams and the combinatorics of the affine symmetric group (type A). We observe that self-conjugate simultaneous core partitions correspond to type C combinato...
متن کاملEnumerating Lattice Paths Touching or Crossing the Diagonal at a Given Number of Lattice Points
We give bijective proofs that, when combined with one of the combinatorial proofs of the general ballot formula, constitute a combinatorial argument yielding the number of lattice paths from (0, 0) to (n, rn) that touch or cross the diagonal y = rx at exactly k lattice points. This enumeration partitions all lattice paths from (0, 0) to (n, rn). While the resulting formula can be derived using ...
متن کاملSquare Lattice Elliptical- Core Photonic Crystal Fiber Soliton-Effect Compressor at 1550nm
In this paper, we investigate the evolution of supercontinuum and femtosecond optical pulses generation through square lattice elliptical-core photonic crystal fiber (PCF) at 1550 nm by using both full-vector multipole method (M.P.M) and novel concrete algorithms: symmetric split-step Fourier (SSF) and fourth order Runge Kutta (RK4) which is an accurate method to solve the general nonlinear...
متن کاملMaximum minimal distance partitioning of the Z2 lattice
We study the problem of dividing the 2 lattice into partitions so that minimal intra-partition distance between the points is maximized. We show that this problem is analogous to the problem of sphere packing. An upper bound on the achievable intra-partition distances for a given number of partitions follows naturally from this observation, since the optimal sphere packing in two dimensions is ...
متن کاملSimultaneous Embeddability of Two Partitions
We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region that contains exactly those points that belong to the elements in the block and that is bounded by a simple closed curve. We establish three main classes of ...
متن کامل